c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
b(c(x1)) → b(a(c(x1)))
c(x1) → a(a(x1))
d(x1) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
b(c(x1)) → b(a(c(x1)))
c(x1) → a(a(x1))
d(x1) → b(c(x1))
C(c(c(a(x1)))) → D(x1)
C(c(c(a(x1)))) → D(d(x1))
B(c(x1)) → B(a(c(x1)))
D(x1) → C(x1)
D(x1) → B(c(x1))
D(b(x1)) → C(x1)
D(b(x1)) → C(c(x1))
c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
b(c(x1)) → b(a(c(x1)))
c(x1) → a(a(x1))
d(x1) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
C(c(c(a(x1)))) → D(x1)
C(c(c(a(x1)))) → D(d(x1))
B(c(x1)) → B(a(c(x1)))
D(x1) → C(x1)
D(x1) → B(c(x1))
D(b(x1)) → C(x1)
D(b(x1)) → C(c(x1))
c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
b(c(x1)) → b(a(c(x1)))
c(x1) → a(a(x1))
d(x1) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
C(c(c(a(x1)))) → D(x1)
C(c(c(a(x1)))) → D(d(x1))
D(x1) → C(x1)
D(b(x1)) → C(x1)
D(b(x1)) → C(c(x1))
c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
b(c(x1)) → b(a(c(x1)))
c(x1) → a(a(x1))
d(x1) → b(c(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
C(c(c(a(x1)))) → D(x1)
D(x1) → C(x1)
D(b(x1)) → C(x1)
Used ordering: Polynomial interpretation [25,35]:
C(c(c(a(x1)))) → D(d(x1))
D(b(x1)) → C(c(x1))
The value of delta used in the strict ordering is 1/4.
POL(C(x1)) = 15/4 + (1/4)x_1
POL(c(x1)) = 2 + x_1
POL(D(x1)) = 4 + (1/4)x_1
POL(a(x1)) = x_1
POL(d(x1)) = 3 + x_1
POL(b(x1)) = 1 + x_1
c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
b(c(x1)) → b(a(c(x1)))
c(x1) → a(a(x1))
d(x1) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
C(c(c(a(x1)))) → D(d(x1))
D(b(x1)) → C(c(x1))
c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
b(c(x1)) → b(a(c(x1)))
c(x1) → a(a(x1))
d(x1) → b(c(x1))